MAX -MIN Ant System for International Timetabling Competition
نویسنده
چکیده
منابع مشابه
A MAX-MIN Ant System for the University Course Timetabling Problem
We consider a simplification of a typical university course timetabling problem involving three types of hard and three types of soft constraints. A MAX -MIN Ant System, which makes use of a separate local search routine, is proposed for tackling this problem. We devise an appropriate construction graph and pheromone matrix representation after considering alternatives. The resulting algorithm ...
متن کاملAnt Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art
Two ant algorithms solving a simplified version of a typical university course timetabling problem are presented – Ant Colony System and MAX -MIN Ant System. The algorithms are tested over a set of instances from three classes of the problem. Results are compared with recent results obtained with several metaheuristics using the same local search routine (or neighborhood definition), and a refe...
متن کاملSolving the University Course Timetabling Problem by Hypercube Framework for ACO
We present a resolution technique of the University course Timetabling problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We presented the structure of the problem and the design of resolution using this framework. A simplification of the UCTP problem is used, involving three types of hard restrictions and three types of soft restr...
متن کاملHypercube FrameWork for ACO applied to timetabling
We present a resolution technique of the University course Timetabling problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We presented the structure of the problem and the design of resolution using this framework. A simplification of the UCTP problem is used, involving three types of hard restrictions and three types of soft restr...
متن کاملطراحی بهینه ابعاد شبکه جمع‌آوری فاضلاب با استفاده از الگوریتم بهینه‌سازی جامعه مورچگان: مقایسه عملکرد چهار الگوریتم
In this paper, the features of Ant Colony Optimization Algorithm (ACOA) are used to find optimal size for sewer network. Two different formulations are proposed. In the first formulation, pipes diameters and in the second formulation, nodal elevations of sewer network are taken as decision variables of the problem. In order to evaluate the performance of different ACOAs, four algorithms of Ant ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003